SOLVING PROCESS PLANNING, WEIGHTED APPARENT TARDINESS COST DISPATCHING, AND WEIGHTED PROCESSING PLUS WEIGHT DUE-DATE ASSIGNMENT SIMULTANEOUSLY USING A HYBRID SEARCH
نویسندگان
چکیده
منابع مشابه
Solving Weighted Number of Operation Plus Processing Time Due-Date Assignment, Weighted Scheduling and Process Planning Integration Problem Using Genetic and Simulated Annealing Search Methods
Traditionally, the three important manufacturing functions, which are process planning, scheduling and due-date assignment, are performed separately and sequentially. For couple of decades, hundreds of studies are done on integrated process planning and scheduling problems and numerous researches are performed on scheduling with due date assignment problem, but unfortunately the integration of ...
متن کاملMinimizing Total Weighted Tardiness in a Flexible Flowshop Environment Considering Batch Processing Machines
Scheduling in production environments is used as a competitive tool to improve efficiency and respond to customer requests. In this paper, a scheduling problem is investigated in a three-stage flexible flowshop environment with the consideration of blocking and batch processing. This problem has been inspired by the charging and packaging line of a large battery manufacturer. In this environmen...
متن کاملThe single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
We study the earliness-tardiness scheduling problem on a single machine with due date assignment and controllable processing times. We analyze the problem with three different due date assignment methods and two different processing time functions. For each combination of these, we provide a polynomialtime algorithm to find the optimal job sequence, due date values and resource allocation minim...
متن کاملSolving Single Machine Total Weighted Tardiness Problem Using Gaussian Process Regression
This paper proposes an application of probabilistic technique, namely Gaussian process regression, for estimating an optimal sequence of the single machine with total weighted tardiness (SMTWT) scheduling problem. In this work, the Gaussian process regression (GPR) model is utilized to predict an optimal sequence of the SMTWT problem, and its solution is improved by using an iterated local sear...
متن کاملCost-Optimal Planning using Weighted MaxSAT
We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automated reasoning for that setting, we develop an approach that operates by solving a sequence of partial weighted MaxSAT problems, each of which corresponds to a step-bounded variant of the problem at hand. Our approach is the first...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: e-Journal of New World Sciences Academy
سال: 2018
ISSN: 1306-3111
DOI: 10.12739/nwsa.2018.13.4.2a0158